The Distributed Kolkata Paise Restaurant Game

The Kolkata Paise Restaurant Problem is a challenging game in which n agents decide where to have lunch during their break. not trivial because there are exactly restaurants, and each restaurant can accommodate only one agent. We study this problem from new angle propose novel strategy that results greater utilization. Adopting spatially distributed approach the restaurants uniformly entire city area makes it possible for every agent visit multiple restaurants. For agent, situation resembles of iconic traveling salesman, who must compute an optimal route through cities. rigorously prove probabilistic formulas confirm advantages policy increase derived equations generalize were previously known literature, be seen as special cases our results.